A Mixed Integer Linear Programming Model For Solving Large-Scale Integrated Location-Routing Problems For Urban Logistics Applications at Groupe La Poste

نویسندگان

  • M. Winkenbach
  • P. R. Kleindorfer
  • B. Lemarié
  • C. Levêque
  • A. Roset
  • S. Spinler
چکیده

In this work we present a large scale static, deterministic mixed inter linear programming model (MIP) solving an integrated location-routing problem (LRP) in the context of urban logistics services (ULS). We aim at determining a cost optimal infrastructure and fleet design for an urban consolidation and transportation network. The model is meant to quantitatively evaluate potential strategic moves of postal operators (POs) into the domain of urban logistics services. It was developed to support the decision making of POs such as French Groupe La Poste in designing an optimal facility network and fleet composition for the centralized consolidation and transportation of freight flows within urban centers. Based on comprehensive analyses with operating data obtained from La Poste, this paper aims at identifying the key determinants of the characteristics of an optimal infrastructure and fleet design to support the development of profitable ULS. Further, we discuss the sensitivity of the optimal design to changes in the input data of the LRP model. ∗[email protected]; WHU Otto Beisheim School of Management, Burgplatz 2, 56179 Vallendar, Germany ∗∗[email protected]; INSEAD, Boulevard de Constance, 77305 Fontainebleau, France †[email protected]; Groupe La Poste, 44 Boulevard de Vaugirard, 75757 Paris, France ‡[email protected]; Groupe La Poste, 44 Boulevard de Vaugirard, 75757 Paris, France §[email protected]; Groupe La Poste, 44 Boulevard de Vaugirard, 75757 Paris, France ¶[email protected]; WHU Otto Beisheim School of Management, Burgplatz 2, 56179 Vallendar, Germany

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...

متن کامل

A Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain

In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

A mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem

In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012